Sieving by Large Integers and Covering Systems of Congruences
نویسندگان
چکیده
An old question of Erdős asks if there exists, for each number N , a finite set S of integers greater than N and residue classes r(n) (mod n) for n ∈ S whose union is Z. We prove that if ∑ n∈S 1/n is bounded for such a covering of the integers, then the least member of S is also bounded, thus confirming a conjecture of Erdős and Selfridge. We also prove a conjecture of Erdős and Graham, that, for each fixed number K > 1, the complement in Z of any union of residue classes r(n) (mod n), for distinct n ∈ (N,KN ], has density at least dK for N sufficiently large. Here dK is a positive number depending only on K . Either of these new results implies another conjecture of Erdős and Graham, that if S is a finite set of moduli greater than N , with a choice for residue classes r(n) (mod n) for n ∈ S which covers Z, then the largest member of S cannot be O(N). We further obtain stronger forms of these results and establish other information, including an improvement of a related theorem of Haight.
منابع مشابه
A polynomial investigation inspired by work of Schinzel and Sierpiński
Define a covering system (or covering) of the integers as a finite collection of congruences x ≡ aj (mod mj), with 1 ≤ j ≤ r, such that every integer satisfies at least one of these congruences. As an interesting application of coverings, W. Sierpiński [4] showed that there are odd positive integers k for which k · 2 + 1 is composite for all integers n ≥ 0. For d ∈ Z, the first author [1] consi...
متن کاملOn an Irreducibility Theorem of A. Schinzel Associated with Coverings of the Integers
A covering of the integers is a system of congruences x aj (mod mj), where aj and mj denote integers with mj > 0 for each j, such that every integer satis es at least one of the congruences. An open problem (which surfaced over 40 years ago) is to determine whether a covering of the integers exists for which the indices j range over a nite set and the mj are distinct odd integers > 1. The probl...
متن کاملANY n ARITHMETIC PROGRESSIONS COVERING THE FIRST 2" INTEGERS COVER ALL INTEGERS
In 1958 S. Stein [7] defined a system of n congruences x = a< (mod bi), 1^-i^n, to be disjoint if no x satisfies more than one of them. He conjectured that for every disjoint system of n congruences with distinct moduli there exists an x, l^x^2", satisfying none of them. P. Erdos [2] proved this with w2n instead of 2" and proposed the stronger conjecture that any system of n congruence classes ...
متن کاملA covering system with least modulus 25
A collection of congruences with distinct moduli, each greater than 1, such that each integer satisfies at least one of the congruences, is said to be a covering system. A famous conjecture of Erdös from 1950 states that the least modulus of a covering system can be arbitrarily large. This conjecture remains open and, in its full strength, appears at present to be unattackable. Most of the effo...
متن کاملCAIRN 3: An FPGA Implementation of the Sieving Step with the Lattice Sieving
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient algorithm for factoring large integers currently, is a threat for such cryptosystems. Recently, Izu et al. developed a dedicated sieving device “CAIRN 2” with Xilinx’s FPGA which is designed to handle up to 768-bit int...
متن کامل